On Computational Complexity of Siegel Julia Sets
نویسندگان
چکیده
منابع مشابه
On computational complexity of Siegel Julia sets
It is known that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification. On the other hand, for a large class of examples the problem of drawing a picture has polynomial complexity. In this paper we demonstrate the existence of computable quadratic Julia sets whose computational complexity is arbitrarily high.
متن کاملComputational Complexity of Euclidean Sets : Hyperbolic Julia Sets are Poly - Time Computable
Computational Complexity of Euclidean Sets: Hyperbolic Julia Sets are Poly-Time Computable Mark Braverman Master of Science Graduate Department of Computer Science University of Toronto 2004 We investigate different definitions of the computability and complexity of sets in R, and establish new connections between these definitions. This allows us to connect the computability of real functions ...
متن کاملOn the Computational Complexity of Defining Sets
Suppose we have a family F of sets. For every S ∈ F , a set D ⊆ S is a defining set for (F , S) if S is the only element of F that contains D as a subset. This concept has been studied in numerous cases, such as vertex colorings, perfect matchings, dominating sets, block designs, geodetics, orientations, and Latin squares. In this paper, first, we propose the concept of a defining set of a logi...
متن کاملComputability and Complexity of Julia Sets (Invited Talk)
Studying dynamical systems is key to understanding a wide range of phenomena ranging from planetary movement to climate patterns to market dynamics. Various numerical tools have been developed to address specific questions about dynamical systems, such as predicting the weather or planning the trajectory of a satellite. However, the theory of computation behind these problems appears to be very...
متن کاملSelf-similarity of Siegel disks and Hausdorff dimension of Julia sets
Let f(z) = ez + z, where θ is an irrational number of bounded type. According to Siegel, f is linearizable on a disk containing the origin. In this paper we show: • the Hausdorff dimension of the Julia set J(f) is strictly less than two; and • if θ is a quadratic irrational (such as the golden mean), then the Siegel disk for f is self-similar about the critical point. In the latter case, we als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 2006
ISSN: 0010-3616,1432-0916
DOI: 10.1007/s00220-006-1546-3